Maximal t-Critical Linear Hypergraphs

نویسنده

Zoltán Füredi

چکیده

A construction using finite affine geometries is given to show that the maximum number of edges in a τ -critical linear hypergraph is (1−o(1))τ2. This asymptotically answers a question of Roudneff [14], Aharoni and Ziv [1]. 1 This copy was printed on November 16, 2001. Submitted to Graphs and Combinatorics

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Computing a Maximal Independent Set in Hypergraph in Parallel

An outstanding open question in the theory of parallel computation is whether a maximal independent set (MIS) in a given hypergraph, can be computed in NC or RNC. One major bottleneck seems to be controlling the dimension of the hypergraph, i.e. the maximum dimension of a hyperedge. In the case of graphs (dimension 2 hypergraphs), Karp and Wigderson’85 gave the first NC algorithm. In the case o...

متن کامل

ON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS

A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.

متن کامل

Generating Dual - Bounded Hypergraphs 1 by

This paper surveys some recent results on the generation of implicitly given hypergraphs and their applications in Boolean and integer programming, data mining, reliability theory, and combinatorics. Given a monotone property π over the subsets of a finite set V , we consider the problem of incrementally generating the family Fπ of all minimal subsets satisfying property π, when π is given by a...

متن کامل

An Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension∗

We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...

متن کامل